Stability and Scalability Assessment of Complexity Estimation Based Work Load Balancing Approach for a Parallel Lidar Waveform Decomposition Algorithm
نویسندگان
چکیده
LIDAR is an active remote sensing technology which performs range measurements from the sensor and converts them into 3D coordinates of the Earth's surface. Recent advances in LIDAR hardware make it possible to digitize full waveforms of the returned energy. LIDAR waveform decomposition involves separating the return waveform into a mixture of Gaussians which is then used to characterize the original data. It plays an important role in LIDAR data processing because the resulting components are expected to represent reflection surfaces within waveform footprints and ultimately affect the interpretation of the data. Computational requirements in the waveform decomposition process result from two factors; (1) estimation of the number of components in a mixture and the resulting parameter estimates are inter-related and cannot be solved separately, (2) parameter optimization does not have a closed form solution, and thus needs to be solved iteratively. A current state-of-the-art airborne LIDAR system acquires more than 50,000 waveforms per second, and the number of waveforms easily exceeds tens of millions even for small area. Therefore, decomposing the enormous number of waveforms is challenging using traditional single processor architecture. Four work load balancing approaches – (1) a no weighting (NW), (2) a linear weighting based on the decomposition results (DRLW), (3) a squared weighting based on the decomposition results (DRSW), and (4) a linear weighting based on the decomposition time (DTLW) of sampled waveforms for a parallel LIDAR waveform decomposition were assessed in terms of the scalability and stability. The DTLW approach yielded the best efficiency when the number of processors is small, and the NW approach showed the most scalable and stable results as the number of processors gets larger.
منابع مشابه
Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm
Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...
متن کاملEfficient Parallel Implementations of Multipole Based N-Body Algorithms
N-body problems pervade many different branches of numerical simulation. While the exact computation of the pairwise interactions between all N components of such a system is O(N) in complexity, approximate solutions often may be computed with O(N log N) or O(N) complexity. This work presents an original design and implementation of a parallel, multipole-based N-body algorithm for particle simu...
متن کاملLoad Balancing for Regular Meshes on SMPs with MPI
Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors (now cores). However, these strategies often do not consider the inherent system noise which can hinder MPI application scalability to emerging peta-scale machines with 10000+ nodes. In this work, we suggest a solution that use...
متن کاملA Hybrid Process/Thread Parallel Algorithm for Generating DEM from LiDAR Points
Airborne Light Detection and Ranging (LiDAR) is widely used in digital elevation model (DEM) generation. However, the very large volume of LiDAR datasets brings a great challenge for the traditional serial algorithm. Using parallel computing to accelerate the efficiency of DEM generation from LiDAR points has been a hot topic in parallel geo-computing. Generally, most of the existing parallel a...
متن کاملA Scalable Dynamic Load-Balancing Algorithm for SPMD Applications on a Non-Dedicated Heterogeneous Network of Workstations (HNOW)
Network based distributed computing has become a cheap alternative to dedicated parallel supercomputer systems due to the recent advances in high-speed network. These systems are becoming widely available in academic and industrial environments. To benefit from the maximum computation power of these systems, it is necessary to use all available resources, namely old machines in addition to more...
متن کامل